Accuracy and Decision Time for Sequential Decision Aggregation
نویسندگان
چکیده
منابع مشابه
Sequential decision aggregation with social pressure
This paper proposes and characterizes a sequential decision aggregation system consisting of agents performing binary sequential hypothesis testing, and a fusion center which collects the individual decisions and reaches the global decision according to some threshold rule. Individual decision makers’ behaviors in the system are influenced by other decision makers, through a model for social pr...
متن کاملProperties of fuzzy relations and aggregation process in decision making
In this contribution connections between input fuzzy relations R1, . . . ,Rn on a set X and the output fuzzy relationRF = F(R1, . . . ,Rn) are studied. F is a function of the form F : [0, 1]n → [0, 1] and RF is called an aggregated fuzzyrelation. In the literature the problem of preservation, by a function F, diverse types of properties of fuzzy relationsR1, . . . ,Rn is examined. Here, it is c...
متن کاملContinuous-time Sequential Decision Feedback: Revisited
Sequential feedback communications has wide ranging applications such as low power communications, error-resilience protocols etc. Two kinds of feedback communication systems can be indentified: information feedback and decision feedback. Continuous-time sequential decision feedback communication is the focus of this paper. The case when the detector test statistic is a Poisson random walk proc...
متن کاملAggregation functions for decision making∗
Aggregation functions are generally defined and used to combine several numerical values into a single one, so that the final result of the aggregation takes into account all the individual values in a given manner. Such functions are widely used in many well-known disciplines such as statistics, economics, finance, and computer science. For general background, see Grabisch et al. [52]. For ins...
متن کاملFully Polynomial Time Approximation Schemes for Sequential Decision Problems
This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and unifying, and many previous results in the literature follow as direct corollaries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the IEEE
سال: 2012
ISSN: 0018-9219,1558-2256
DOI: 10.1109/jproc.2011.2180049